Lagrange's Theorem for Binary Squares
نویسندگان
چکیده
We prove, using a decision procedure based on finite automata, that every natural number>686 is the sum of at most 4 natural numbers whose canonical base-2 representation is a binary square, that is, a string of the form xx for some block of bits x.
منابع مشابه
Lagrange ' S Theorem with N " 3 Squares
For every N > I we construct a set A of squares such that JA < (4/log 2)N 1 / 3 log N and every nonnegative integer n < N is a sum of four squares belonging to A . Let A be an increasing sequence of nonnegative integers and let A(x) denote the number of elements of A not exceeding x. If every nonnegative integer up to x is a sum of four elements of A, then A(x)4 > x and so A(x) > x 1/4. In 1770...
متن کاملA Short Proof and Generalization of Lagrange's Theorem on Continued Fractions
We present a short new proof that the continued fraction of a quadratic irrational eventually repeats. The proof easily generalizes; we construct a large class of functions which, when iterated, must eventually repeat when starting with a quadratic irrational.
متن کاملWhy Did Lagrange "Prove" the Parallel Postulate?
1. INTRODUCTION. We begin with an often-told story from the Budget of Paradoxes by Augustus de Morgan: " Lagrange, in one of the later years of his life, imagined " that he had solved the problem of proving Euclid's parallel postulate. " He went so far as to write a paper, which he took with him to the [Institut de France], and began to read it. " But, De Morgan continues, " something struck hi...
متن کاملSimultaneous Determination of Sulfamethoxazole and Phthalazine by HPLC and Multivariate Calibration Methods
Two multivariate calibration methods are compared for the simultaneous chromatographic determination and separation of Sulfamethoxazole (SMX) and Phthalazine (PHZ) by High Performance Liquid Chromatography (HPLC). Multivariate calibration techniques such as Classical Least Squares (CLS) and Inverse Least Squares (ILS) were introduced into HPLC to determine the quantification by using UV d...
متن کاملMoufang Loops of Small Order
The main result of this paper is the determination of all nonassociative Moufang loops of orders *31. Combinatorial type methods are used to consider a number of cases which lead to the discovery of 13 loops of the type in question and prove that there can be no others. All of the loops found are isomorphic to all of their loop isotopes, are solvable, and satisfy both Lagrange's theorem and Syl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1710.04247 شماره
صفحات -
تاریخ انتشار 2017